Uniformly bounded duplication codes

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Uniformly bounded duplication codes

Duplication is the replacement of a factor w within a word by ww. This operation can be used iteratively to generate languages starting from words or sets of words. By undoing duplications, one can eventually reach a square-free word, the original word’s duplication root. The duplication root is unique, if the length of duplications is fixed. Based on these unique roots we define the concept of...

متن کامل

Bounded Prefix-Suffix Duplication

Abs t r ac t . We consider a restricted variant of the prefix-sufñx duplication operation, called bounded prefix-sufñx duplication. It consists in the iterative duplication of a prefix or suffix, whose length is bounded by a constant, of a given word. We give a sufncient condition for the closure under bounded prefix-sufñx duplication of a class of languages. Consequently, the class of regular ...

متن کامل

Uniformly bounded components of normality

Suppose that f(z) is a transcendental entire function and that the Fatou set F (f) 6= ∅. Set B1(f) := sup U supz∈U log(|z| + 3) infw∈U log(|w|+ 3) and B2(f) := sup U supz∈U log log(|z|+ 30) infw∈U log(|w| + 3) , where the supremum supU is taken over all components of F (f). If B1(f) < ∞ or B2(f) < ∞, then we say F (f) is strongly uniformly bounded or uniformly bounded respectively. In this arti...

متن کامل

Duplication-Correcting Codes

In this work, we propose constructions that correct duplications of multiple consecutive symbols. These errors are known as tandem duplications, where a sequence of symbols is repeated; respectively as palindromic duplications, where a sequence is repeated in reversed order. We compare the redundancies of these constructions with code size upper bounds that are obtained from sphere packing argu...

متن کامل

The Cayley Transform and Uniformly Bounded Representations

Let G be a simple Lie group of real rank one, with Iwasawa decomposition KAN̄ and Bruhat big cell NMAN̄ . Then the space G/MAN̄ may be (almost) identified with N and with K/M , and these identifications induce the (generalised) Cayley transform C : N → K/M . We show that C is a conformal map of Carnot–Caratheodory manifolds, and that composition with the Cayley transform, combined with multiplicat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: RAIRO - Theoretical Informatics and Applications

سال: 2007

ISSN: 0988-3754,1290-385X

DOI: 10.1051/ita:2007021